Effect of the Degree of Neighborhood on Resource Discovery in Ad Hoc Grids

Resource management is one of the important issues in the e cient use of grid computing, in general, and poses speci c challenges in the context of ad hoc grids due to the heterogeneity, dynamism, and intermittent participation of participating nodes in the ad hoc grid. In this paper, we consider three di erent kinds of organizations in an ad hoc grid ranging from completely centralized to completely decentralized (P2P). On the basis of self organization mechanisms, we study the e ect of the neighborhood degree of a node for nding resources on the e ciency of resource allocation. We investigate the message complexity of each organization and its corresponding e ciency in terms of task/resource matching and the response time. We show that the intermediate state of the ad hoc grid with multiple adaptive matchmakers outperforms both a completely centralized and a completely decentralized (P2P) infrastructure.